Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules

Association rules are among the most widely employed data analysis methods in the field of Data Mining. An association rule is a form of partial implication between two sets of binary variables. In the most common approach, association rules are usually parameterized by a lower bound on their confidence, which is the empirical conditional probability of their consequent given the antecedent, an...

متن کامل

Deduction Schemes for Association Rules

Several notions of redundancy exist for Association Rules. Often, these notions take the form “any dataset in which this first rule holds must obey also that second rule, therefore the second is redundant”; if we see datasets as interpretations (or models) in the logical sense, this is a form of logical entailment. In many logics, entailment has a syntactic counterpart in the form of a deductio...

متن کامل

Minimum-Size Bases of Association Rules

We focus on confidence-bounded association rules; we model a rather practical situation in which the confidence threshold is fixed by the user, as usually happens in applications. Within this model, we study notions of redundancy among association rules from a fundamental perspective: we discuss several existing alternative definitions and provide new characterizations and relationships between...

متن کامل

Representative Association Rules and Minimum Condition Maximum Consequence Association Rules

Discovering association rules (AR) among items in a large database is an important database mining problem. The number of association rules may be large. To alleviate this problem, we introduced in [1] a notion of representative association rules (RR). RR is a least set of rules that covers all association rules. The association rules, which are not representative ones, may be generated by mean...

متن کامل

Galois Lattices and Bases for MGK-Valid Association Rules

We review the main properties of the quality measure MGK, which has been shown to be the normalized quality measure associated to most of the quality measures used in the data mining literature, and which enables to handle negative association rules. On the other hand, we characterize bases for MGK-valid association rules in terms of a closure operator induced by a Galois connection. Thus, thes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logical Methods in Computer Science

سال: 2010

ISSN: 1860-5974

DOI: 10.2168/lmcs-6(2:4)2010